Verifying Properties of Large Sets of Processes with Network Invariants
نویسندگان
چکیده
منابع مشابه
Splice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کاملLarge amplitude vibration prediction of rectangular plates by an optimal artificial neural network (ANN)
In this paper, nonlinear equations of motion for laminated composite rectangular plates based on the first order shear deformation theory were derived. Using a perturbation method, the nonlinear equation of motion was solved and analytical relations were obtained for natural and nonlinear frequencies. After proving the validity of the obtained analytical relations, as an alternative and simple ...
متن کاملVerifying Properties of Large Sets of Processes
If a system is built from a large number of identical finite-state processes, it seems intuitively obvious that, with the help of “a little induction”, the verification of such a system can be reduced to a finite-state problem. The difficulty is to find the right form of “a little induction”. There have been several attempts to address this problem in the context of model-checking [CGB86], [CG8...
متن کاملA Strategy for Efficiently Verifying Requirements Specifications Using Composition and Invariants
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker or a theorem prover, uses known state invariants to prove state and transition invariants. Two proof rules are presented: a standard incremental proof rule analogous to Manna and Pnueli’s incremental proof rule and a c...
متن کاملOn the Existence of Network Invariants for Verifying Parameterized Systems
Over the last decade, nite-state veriication methods have been developed to an impressive tool for analysis of complex programs, such as protocols and hardware circuits. Partial-order reduction and BDD-based symbolic model checking have been instrumental in this development. Currently, much eeort is devoted to advancing further the power of automated veriication to cover also innnite-state syst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989